A faster sorting algorithm in the broadcast communication model
نویسندگان
چکیده
The main contribution of this work is to present a simple sorting algorithm for the broadcast communication model (BCM, for short). With a sequence on n items as input, our algorithm runs in O(n p log n p + n k + log k) time on a p-processor, k-channel BCM, a considerable improvement over the state of the art.
منابع مشابه
Sorting in Few Rounds on the Broadcast Communication Model
The main contribution of this work is to present a simple, fast ranking and sorting algorithms in the broadcast communication model (BCM, for short). At the heart of our algorithm is a new and elegant sampling and bucketing scheme. The main feature of our sampling scheme is that the resulting buckets are well balanced, making costly rebalancing unnecessary. The resulting algorithm uses only 2 n...
متن کاملBroadcast-Efficient Algorithms on the Coarse-Grain Broadcast Communication Model with Few Channels
The main contribution of this work is to present elegant broadcast-efficientalgorithms for permutation routing, ranking, and sorting n items on the Broadcast Communication Model (BCM, for short) endowed with p processors and k communication channels. We begin by presenting an optimal off-line routing algorithm using nk broadcast rounds for any k, p, and n. We then go on to develop an on-line ro...
متن کاملAn Adapted Non-dominated Sorting Algorithm (ANSA) for Solving Multi Objective Trip Distribution Problem
Trip distribution deals with estimation of trips distributed among origins and destinations and is one of the important stages in transportation planning. Since in the real world, trip distribution models often have more than one objective, multi-objective models are developed to cope with a set of conflict goals in this area. In a proposed method of adapted non-dominated sorting algorithm (ANS...
متن کاملConflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication Models
In this paper, we shall first propose an optimal conflict-free parallel sorting algorithm under the single-channel broadcast communication model. The time complexity of this algorithm is O((n/p)log(n/p)+n) if p processors are used to sort n data elements. We then apply our single--channel sorting algorithm to improve the multi-channel sorting algorithm proposed by Marberg and Gafni. Since there...
متن کاملBroadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995